Robust logic gates and realistic quantum computation
نویسندگان
چکیده
منابع مشابه
Multivalued logic gates for quantum computation
We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d .2) can be decomposed into logic gates that operate on only two systems at a time....
متن کاملRobust gates for holonomic quantum computation
Giuseppe Florio, 2 Paolo Facchi, 2 Rosario Fazio, 5 Vittorio Giovannetti, and Saverio Pascazio Dipartimento di Fisica, Università di Bari, I-70126 Bari, Italy INFN, Sezione di Bari, I-70126 Bari, Italy Dipartimento di Matematica, Università di Bari, I-70125 Bari, Italy NEST CNR-INFM & Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy International School for Advanced Studies (...
متن کاملEfficient implementation of coupled logic gates for quantum computation
Most natural Hamiltonians do not couple specific pairs of quantum bits and spurious couplings occur along with the intended one. We present an efficient scheme that couples any designated pair of spins in heteronuclear spin systems. The scheme is based on the existence of Hadamard matrices. For a system of n spins with pairwise coupling, the scheme concatenates cn intervals of system evolution ...
متن کاملTesting CMOS Logic Gates for Realistic Shorts
It is assumed that tests generated using the single stuck-at fault model will implicitly detect the vast majority of fault-causing defects within logic elements. This may not be the case. In this paper we characterize the possible shorts in the combinational cells in a standard cell library. The characterization includes errors on the cell outputs, errors on the cell inputs, and excessive quies...
متن کاملElementary gates for quantum computation.
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2006
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.73.032334